Game of Life

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

Game of Life is a simple two-state cellular automata based on a rectangular grid of squares, where each square is colured as active (alive) or a background color (dead or empty). If an empty cell has three live neighbours it becomes active/alive. If a live cell has two many live neighbours (4 or more) it is overcrowded and dies. If it has only one live neighbour it is lonely and also dies. From these simple rules many dynamic patterns emerge.

Used on Chap. 16: pages 384, 388

Also known as Conway's Game of Life